Describing High-order Statistical Dependence Using “concurrence Topology,” with Application to Functional Mri Brain Data

In multivariate data analysis dependence beyond pair-wise can be important. With many variables, however, the number of simple summaries of even third-order dependence can be unmanageably large. “Concurrence topology” is an apparently new method for describing high-order dependence among up to dozens of dichotomous (i.e., binary) variables (e.g., seventh-order dependence in 32 variables). This method generally produces summaries of dependence of manageable size. (But computing time can be lengthy.) For time series, this method can be applied in both the time and Fourier domains. Write each observation as a vector of 0’s and 1’s. A “concurrence” is a group of variables all labeled “1” in the same observation. The collection of concurrences can be represented as a filtered simplicial complex. Holes in the filtration indicate relatively weak or negative association among the variables. The pattern of the holes in the filtration can be analyzed using persistent homology. We applied concurrence topology on binarized, resting-state, functional MRI data acquired from patients diagnosed with attention-deficit hyperactivity disorder and from healthy controls. An exploratory analysis finds a number of differences between patients and controls in the topologies of their filtrations, demonstrating that concurrence topology can find in data high-order structure of real-world relevance. This research is supported in part by United States PHS grants MH62185 and MH084029. Received May 22, 2013, revised October 25, 2013; published on May 27, 2014. 2010 Mathematics Subject Classification: 62H17, 92C55, 62M15.